翻訳と辞書
Words near each other
・ JanusVR
・ Janusz
・ Janusz A. Zajdel Award
・ Janusz Adam Kobierski
・ Janusz Adamiec
・ Janusz Akermann
・ Janusz Aleksander Sanguszko
・ Janusz Andrzej Zakrzewski
・ Janusz Bardach
・ Janusz Bielański
・ Janusz Bobik
・ Janusz Bojarski
・ Janusz Bokszczanin
・ Janusz Bolonek
・ Janusz Brzozowski
Janusz Brzozowski (computer scientist)
・ Janusz Brzozowski (handballer)
・ Janusz Bugajski
・ Janusz C. Szajna
・ Janusz Centka
・ Janusz Christa
・ Janusz Chwierut
・ Janusz Cisek
・ Janusz Dobrosz
・ Janusz Domaniewski
・ Janusz Dziedzic
・ Janusz Dzięcioł
・ Janusz Gajos
・ Janusz Gancarczyk
・ Janusz Gaudyn


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Janusz Brzozowski (computer scientist) : ウィキペディア英語版
Janusz Brzozowski (computer scientist)

Janusz (John) Antoni Brzozowski (born on May 10, 1935 in Warsaw, Poland) is a Polish-Canadian computer scientist.
In 1962, Brzozowski earned his PhD in the field of electrical engineering at Princeton University under Edward J. McCluskey. The topic of the thesis was ''Regular Expression Techniques for Sequential Circuits''. From 1967 to 1996 he was Professor at the University of Waterloo. He is known for his contributions to mathematical logic, circuit theory and automata theory.
==Achievements in research==
Brzozowski worked on regular expressions and on syntactic semigroups of formal languages.〔Pin (1997)〕 The result was ''Characterizations of locally testable events'' written together with Imre Simon, which had a similar impact〔Diekert et al. (2008)〕 on the development of the algebraic theory of formal languages as Marcel-Paul Schützenberger's characterization of the star-free languages.
In the area, there are today at least three concepts bearing Brzozowski's name in honour of his contributions: The first is the ''Brzozowski conjecture''〔de Luca and Varicchio (1997)〕 about the regularity of noncounting classes. Second, ''Brzozowski's algorithm'' 〔Shallit (2009), ch. 3.10〕 is a conceptually simple algorithm for performing DFA minimization. Third, Eilenberg's reference work on automata theory has a chapter devoted to the so-called ''Brzozowski hierarchy''〔Eilenberg (1974)〕 inside the star-free languages, also known as ''dot-depth hierarchy''. Curiously, Brzozowski was not only co-author of the paper〔Cohen and Brzozowski (1971)〕 that defined the dot-depth hierarchy and raised the question whether this hierarchy is strict, he later also was co-author of the paper〔Brzozowski and Knast (1979)〕 resolving that problem after roughly ten years. The Brzozowski hierarchy gained further importance after Thomas discovered a relation between the algebraic concept of dot-depth and the alternation depth of quantifiers in first-order logic via Ehrenfeucht-Fraïssé games.〔Thomas (1982)〕
He received the following academic awards:
* NSERC Scientific Exchange Award to France (1974–1975)
* Japan Society for the Promotion of Science Research Fellowship (1984)
* Distinguished Professor Emeritus, University of Waterloo, Canada (1996)〔(Profile of John Brzozowski )〕
* Medal of Merit, Catholic University of Lublin, Poland (2001)
* Canadian Pioneer in Computing〔(Pioneers of Computing in Canada )〕 (2005)

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Janusz Brzozowski (computer scientist)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.